Fractal Image Compression on MIMD Architectures II: Classification Based Speed-up Methods
نویسندگان
چکیده
منابع مشابه
Fractal Image Compression on Mimd Architectures I: Basic Algorithms
In this paper parallel algorithms for fractal image compression on MIMD architectures are introduced, classi ed, and discussed. The crucial point for the choice of a suitable parallelization strategy is the memory capacity of a processor element of the target architecture, therefore the classi cation follows the memory demand of the algorithms. We present experimental results of all main-repres...
متن کاملClassification Based Speed-Up Methods for Fractal Image Compression on Multicomputers
Since fractal image compression is computationally very expensive , speedup techniques are required in addition to parallel processing in order to compress large images in reasonable time. In this paper we introduce a new parallelization approach for fractal image compression algorithms which employ block classiication as speedup method suited for multicomputers.
متن کاملParallel Algorithms for Fractal Image Coding on Mimd Architectures
In this paper parallel algorithms for fractal image coding on MIMD architectures are introduced and discussed. It turns out that the crucial point for the choice of a suitable parallelization strategy is the memory capacity of a processor element. Experimental results show a linear speedup of the proposed algorithms.
متن کاملOn speeding up fractal image compression
In this work an improved classification algorithm is introduced, with the help of which the usually time consuming searching part of fractal image encoding speeds up considerably without loss of the reconstruction fidelity. Two parameters are used to sort image blocks into disjoint classes: the direction of the approximate first derivative and a normalized root mean square error of the fitting ...
متن کاملSpeeding up Fractal Image Compression
Fractal coding of digital images ooers many promising qualities. However the coding process suuers from the long search time of the domain block pool. In this paper, we obtain mathematical results on the distance measure used in the search. Then we derive an incremental procedure to bound the domain block pixels. We arrange the domain blocks in a tree structure, and utilise the procedure to dir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2000
ISSN: 1330-1136,1846-3908
DOI: 10.2498/cit.2000.01.06